Do isomorphic structural matrix rings have isomorphic graphs?

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Do Isomorphic Structural Matrix Rings Have Isomorphic Graphs?

We first provide an example of a ring R such that all possible 2 × 2 structural matrix rings over R are isomorphic. However, we prove that the underlying graphs of any two isomorphic structural matrix rings over a semiprime Noetherian ring are isomorphic, i.e. the underlying Boolean matrix B of a structural matrix ring M(B,R) over a semiprime Noetherian ring R can be recovered, contrary to the ...

متن کامل

Searching isomorphic graphs

To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomorphic, in each of them we can find such positionally equivalent auxiliary digraphs that have the same mutual positioning of vertices. Obviously, if...

متن کامل

Isomorphic Factorisations . I : Complete Graphs

An isomorphic factorisation of the complete graph Kj, is a partition of the lines of Kp into t isomorphic spanning subgraphs G; we then write G\Kj, and G G K^/t. If the set of graphs Ky/t is not empty, then of course t\p(p — l)/2. Our principal purpose is to prove the converse. It was found by Laura Guidotti that the converse does hold whenever (/,/>) » 1 or (t,p — 1) «= 1, We give a new and sh...

متن کامل

Graphs Isomorphic to Their Path Graphs

We prove that for every number n 1, the n-iterated P3-path graph of G is isomorphic to G if and only if G is a collection of cycles, each of length at least 4. Hence, G is isomorphic to P3(G) if and only if G is a collection of cycles, each of length at least 4. Moreover, for k 4 we reduce the problem of characterizing graphs G such that Pk(G) ∼= G to graphs without cycles of length exceeding k.

متن کامل

Isomorphic Cayley graphs on nonisomorphic groups

The issue of when two Cayley digraphs on different abelian groups of prime power order can be isomorphic is examined. This had previously been determined by Anne Joseph for squares of primes; her results are extended.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1996

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-96-03172-3